Focus and Higher{order Uniication
نویسندگان
چکیده
Pulman has shown that Higher{Order Uniication (HOU) can be used to model the interpretation of focus. In this paper , we extend the uniication{based approach to cases which are often seen as a test{bed for focus theory: utterances with multiple focus operators and second occurrence expressions. We then show that the resulting analysis favourably compares with two prominent theories of focus (namely, Rooth's Alternative Semantics and Krifka's Structured Meanings theory) in that it correctly generates interpretations which these alternative theories cannot yield. Finally, we discuss the formal properties of the approach and argue that even though HOU need not terminate, for the class of uniication{problems dealt with in this paper, HOU avoids this shortcoming and is in fact computationally tractable.
منابع مشابه
Higher-Order Unification via Explicit Substitutions (Extended Abstract)
Higher-order uniication is equational uniication for-conversion. But it is not rst-order equational uniication, as substitution has to avoid capture. In this paper higher-order uniication is reduced to rst-order equational uniication in a suitable theory: the-calculus of explicit substitutions.
متن کاملDecidable Higher-Order Uni cation Problems
Second-order uniication is undecidable in general. Miller showed that uniication of so-called higher-order patterns is decidable and unitary. We show that the uniication of a linear higher-order pattern s with an arbitrary second-order term that shares no variables with s is decidable and nitary. A few extensions of this uniication problem are still decidable: unifying two second-order terms, w...
متن کاملHigher-Order Rigid E-Unification
Higher-order E-uniication, i.e. the problem of nding substitutions that make two simply typed-terms equal modulo or-equivalence and a given equational theory, is undecidable. We propose to rigidify it, to get a resource-bounded decidable uniication problem (with arbitrary high bounds), providing a complete higher-order E-uniication procedure. The techniques are inspired from Gallier's rigid E-u...
متن کاملMulti-paradigm Logic Programming towards a Higher Order Uniication Based on Proof Nets
We study a higher order uniication procedure based on proof nets. In this paper, we present higher order uniication algorithm for intuitionistic implicational multiplicative fragment of proof nets and show termination and soundness for the algorithm.
متن کاملHigher Order Unification via Explicit Substitutions
Higher order uniication is equational uniication for-conversion. But it is not rst order equational uniication, as substitution has to avoid capture. Thus the methods for equational uniication (such as narrowing) built upon grafting (i.e. substitution without renaming), cannot be used for higher order uniication, which needs speciic algorithms. Our goal in this paper is to reduce higher order u...
متن کامل